Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

Abstract We define a geometric transformation of Euclidean Travelling Salesman Problem (TSP) tours that leads to new formulation the TSP. For every TSP n-city tour, it is possible construct an inscribed n-polygon (Equivalent Cyclic Polygon, ECP) such lengths edges are equal corresponding tour links and follow same sequence order. The analysis ECP elicits possibility defining objective function in terms angles instead distances. This modification opens way identify characterizing parameters as well explore heuristics based on inclusion additional constraints. experimentation with set cases shows promising results compared traditional compact formulations. behavior ECP-based formulations better when nodes randomly or evenly distributed.